A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing
نویسندگان
چکیده
منابع مشابه
A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
Article history: Received 20 November 2009 Accepted 3 January 2011 Available online 8 January 2011
متن کاملA branch-and-cut algorithm for the hub location and routing problem
We study the hub location and routing problem where we jointly decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total transportation cost. Each hub has one vehicle that visits all the nodes assigned to it on a cycle. We propose a mixed integer programming formulation for this problem and s...
متن کاملA Branch-and-Cut-and-Price Algorithm for the Capacitated Location-Routing Problem
In this paper we present an exact algorithm for the Capacitated LocationRouting Problem (CLRP) based on column and cut generation. The CLRP is formulated as a set-partitioning problem which also inherits all of the known valid inequalities for the flow formulations of the CLRP. We introduce five new families of inequalities that are shown to dominate some of the cuts from the two-index formulat...
متن کاملA Branch-and-cut Algorithm for the Capacitated Location-routing Problem
This paper describes a branch-and-cut algorithm for the Capacitated LocationRouting Problem (CLRP). In the CLRP customers with known demands must be served from capacitated facilities by an unlimited fleet of homogeneous, capacitated vehicles. The problem is to select a subset of potential facilities and to design vehicle routes around these facilities so that every customer is visited exactly ...
متن کاملA branch-and-cut algorithm for the partitioning-hub location-routing problem
We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2019
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.2018.0869